Lattices do not distribute over powerset

Stackelberg Scheduling Strategies (DRAFT – DO NOT DISTRIBUTE)

We study the problem of optimizing the performance of a system shared by selfish, noncooperative users. We consider the concrete setting of scheduling jobs on a set of shared machines with loaddependent latency functions specifying the length of time necessary to complete a job; we measure system performance by the total latency of the system. Assigning jobs according to the selfish interests o...

Draft – Please Do Not Distribute with Permission

As graph models are applied to more widely varying fields, researchers struggle with tools that are at times too general or too specific for their needs. The Zoomgraph system attempts to address this issue by allowing users to define graphs with complex node and edge attributes, and providing a command and scripting language to manipulate and explore these graphs. The tool, which is publicly av...

Draft Version – Do not cite or distribute

Faster Schedules for Diiusive Load Balancing via Over{relaxation (*****draft. Do Not Distribute*****)

Consider the following load balancing problem. We are given a graph with arbitrary topology and an arbitrary load distribution on the nodes. In each time step, a node can send any amount of load to each neighbor in parallel. This problem is a simple formalization of dynamic load balancing problems arising in various applications on parallel and distributed machines. Earlier work on this problem...

To distribute or not to distribute?

In this paper we address some central problems of combination of logics through the study of a very simple but highly informative case, the combination of the logics of disjunction and conjunction. At first it seems that it would be very easy to combine such logics, but the following problem arises: if we combine these logics in a straightforward way, distributivity holds. On the other hand, di...